Efficient Pattern Matching With Flexible Wildcard Gaps and One-off Constraint
نویسندگان
چکیده
....................................................................................................................... iii Table of
منابع مشابه
WildSpan: Efficient Discovery of Functional Motifs Spanning Large Wildcard Regions from Protein Sequences
Motivation: Automatic extraction of motifs from biological sequences is an important problem in molecular biology. For proteins, it is desired to discover sequence motifs containing large irregular gaps as the contact residues associated with a functional site are not always from one region of the sequences. Discovering such patterns is a time-consuming task due to a large number of combination...
متن کاملFrom coding theory to efficient pattern matching
We consider the classic problem of pattern matching with few mismatches in the presence of promiscuously matching wildcard symbols. Given a text t of length n and a pattern p of length m with optional wildcard symbols and a bound k, our algorithm finds all the alignments for which the pattern matches the text with Hamming distance at most k and also returns the location and identity of each mis...
متن کاملStreaming Pattern Matching with d Wildcards
In the pattern matching with d wildcards problem we are given a text T of length n and a pattern P of length m that contains d wildcard characters, each denoted by a special symbol ′?′. A wildcard character matches any other character. The goal is to establish for each m-length substring of T whether it matches P . In the streaming model variant of the pattern matching with d wildcards problem ...
متن کاملSpace-Efficient String Indexing for Wildcard Pattern Matching
In this paper we describe compressed indexes that support pattern matching queries for strings with wildcards. For a constant size alphabet our data structure uses O(n log n) bits for any ε > 0 and reports all occ occurrences of a wildcard string in O(m + σ · μ(n) + occ) time, where μ(n) = o(log log logn), σ is the alphabet size, m is the number of alphabet symbols and g is the number of wildca...
متن کاملThree Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014